Deep Graph Mapper: Seeing Graphs Through the Neural Lens

نویسندگان

چکیده

Graph summarization has received much attention lately, with various works tackling the challenge of defining pooling operators on data regions arbitrary structures. These contrast grid-like ones encountered in image inputs, where techniques such as max-pooling have been enough to show empirical success. In this work, we merge Mapper algorithm expressive power graph neural networks produce topologically grounded summaries. We demonstrate suitability a topological framework for by proving that is generalization methods based soft cluster assignments. Building upon this, how easy it design novel algorithms obtain competitive results other state-of-the-art methods. Additionally, use our method GNN-aided visualisations attributed complex networks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Tracking: Seeing Beyond Seeing Using Recurrent Neural Networks

This paper presents to the best of our knowledge the first end-to-end object tracking approach which directly maps from raw sensor input to object tracks in sensor space without requiring any feature engineering or system identification in the form of plant or sensor models. Specifically, our system accepts a stream of raw sensor data at one end and, in real-time, produces an estimate of the en...

متن کامل

Viewing Graph Transformation through the Algorithmic Lens

We present an algorithmic view of graph transformation systems, a powerful infinite-state system model, obtained through a study of decidability issues for reachability problems. Fora fixed initial configuration, we consider reachability of an entirely specified configuration and of aconfiguration that satisfies a given pattern (coverability). The former is a fundamental problem for...

متن کامل

Line graphs associated to the maximal graph

Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...

متن کامل

Graph Attribution Through Sub-Graphs

We offer an alternative to the standard formalisation of attributed graphs. We propose to represent an attributed graph as a graph with a marked sub-graph, in which the sub-graph represents the data domain, rather than as a tuple of graph and algebra. This is a general construction which can be shown to preserve adhesiveness of categories; it has the advantage of uniformity and gives more flexi...

متن کامل

A new look at clustering through the lens of deep convolutional neural networks

Classification and clustering have been studied separately in machine learning and computer vision. Inspired by the recent success of deep learning models in solving various vision problems (e.g., object recognition, semantic segmentation) and the fact that humans serve as the gold standard in assessing clustering algorithms, here, we advocate for a unified treatment of the two problems and sug...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in big data

سال: 2021

ISSN: ['2624-909X']

DOI: https://doi.org/10.3389/fdata.2021.680535